
public class Opp1b_stigma {
	
	//DONE
	
	//basis cases
	static int a0 = 2;
	static int a1 = 5;
	
	public static void main(String[] args) {
		
		//choose sequence number for the number you wish to find
		int findThisNumber = 10;
		for (int i=0; i <= findThisNumber; i++) {
			System.out.println(RecursiveFind(i));
		}
		
	}
	
	public static int RecursiveFind(int number) {
		
		//if we hit one of the basis cases then we know the value to return
		if (number == 0) {return a0;}
		if (number == 1) {return a1;}
		
		//otherwise, use the recursiveFind to find the numbers
		int result = (5*RecursiveFind(number-1)) - (6*RecursiveFind(number-2)) + 2;
		return result;
	}
}
